Outlier-Resistant Orthogonal Regression via the Reformulation-Linearization Technique
نویسندگان
چکیده
منابع مشابه
Outlier-Resistant L1 Orthogonal Regression via the Reformulation-Linearization Technique
Assessing the linear relationship between a set of continuous predictors and a continuous response is a well-studied problem in statistics and data mining. L2-based methods such as ordinary least squares and orthogonal regression can be used to determine this relationship. However, both of these methods become impaired when influential values are present. This problem becomes compounded when ou...
متن کاملReduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations
In this paper, we consider the reformulation-linearization technique (RLT) of Sherali and Adams (SIAM J. Discrete Math. 3 (3) (1990) 411–430, Discrete Appl. Math. 52 (1994) 83– 106) and explore the generation of reduced rst-level representations for 0–1 mixed-integer programs that tend to retain the strength of the full rst-level linear programming relaxation. The motivation for this study is p...
متن کاملAlgorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique
In this paper, we propose two exact algorithms for the GQAP (generalized quadratic assignment problem). In this problem, given M facilities and N locations, the facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each locat...
متن کاملGlobal Optimization of the Nonconvex Containership Design Problem Using the Reformulation-Linearization Technique
(ABSTRACT) The containership design problem involves optimizing a nonconvex objective function over a design space that is restricted by a set of constraints defined in terms of nonconvex functions. An application of standard nonlinear optimization methods to such a problem can at best attain a local optimum that need not be a global optimum. This thesis investigates the application of alternat...
متن کاملReformulation-Linearization Methods for Global Optimization
Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Operations Research
سال: 2011
ISSN: 1687-9147,1687-9155
DOI: 10.1155/2011/263762